Shortest-Path Routing in Arbitrary Networks

نویسندگان

  • Friedhelm Meyer auf der Heide
  • Berthold Vöcking
چکیده

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D+log N) steps, with high probability. This time bound is optimal up to the additive log N , and it has previously only been reached for bounded-degree leveled networks. Further, we show that the above bound holds also for random routing problems with C denoting the maximum expected congestion over all links. Based on this result, we give applications for random routing in Cayley networks, general node symmetric networks, edge symmetric networks, and de Bruijn networks. Finally, we examine the problems arising when our approach is applied to routing along non-shortest paths, deterministic routing, or routing with bounded buffers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks

Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...

متن کامل

Shortest Paths Routing in Arbitrary Networks

We introduce an on{line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D +log N) steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for bounded{degree leveled networks. Further, we show that the above bound holds also for random routing p...

متن کامل

Worst Case Bounds for Shortest Path Interval Routing

Consider shortest path interval routing a popular memory balanced method for solving the routing problem on arbitrary networks Given a network G let Irs G denote the maximum number of intervals necessary to encode groups of destinations on an edge minimized over all shortest path interval routing schemes on G In this paper we establish tight worst case bounds on Irs G More precisely for any n w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Algorithms

دوره 31  شماره 

صفحات  -

تاریخ انتشار 1999